Parsing Composed Grammars with Language Boxes
نویسندگان
چکیده
Parsing uncovers if, and how, an input stream conforms to a grammar. Language composition requires combining grammars together, yet all traditional parsing techniques have limitations when parsing composed grammars. We augment an incremental parser with language boxes, which allows us to retain the feel of traditional parsing whilst allowing arbitrary grammar composition.
منابع مشابه
Linguistic Facts as Predicates over Ranges of the Sentence
This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not limited to, ranges of the current sentence. Such an approch allows to build non-linear analyses with a polynomial parsing complexity that take into account simultaneously and with the same technical status morphological, syntacti...
متن کاملVarieties of Heuristics in Sentence Parsing * Makoto
There are many methods of sentence parsing, but parsing always presupposes a grammar, which is usually composed of a set of so-called grammatical rules or rewriting rules. There are many grammars proposed so far, and many parsing algorithms have been developed based on these grammars. Characteristics of these parsing algorithms are a direct reflection of the features of the grammar formalisms u...
متن کاملLog File Analysis with Context-Free Grammars
Classical ways of intrusion analysis from textual communication log files are either AI-based (such as by combinations of data mining with various techniques of machine learning), or they are based on regular expressions (such as the scanners implemented in the ‘CISCO boxes’). Whereas AI-based heuristics are not analytically exact, methods based on regular expressions do not reach very far in C...
متن کاملParsing Non-Recursive Context-Free Grammars
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملParsing Algorithms for Grammars with Regulated Rewriting
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified into the Petri net formalism, i.e., a grammar and its control can be represented by a Petri net. Thi...
متن کامل